Improving diameter bounds for distance-regular graphs
نویسندگان
چکیده
منابع مشابه
Improving diameter bounds for distance-regular graphs
In this paper we study the sequence (ci)0≤i≤d for a distance-regular graph. In particular we show that if d ≥ 2j and cj = c > 1 then c2j > c holds. Using this we give improvements on diameter bounds by Hiraki and Koolen [5], and Pyber [8], respectively, by applying this inequality.
متن کاملTight Distance-regular Graphs with Small Diameter
We prove the following bound for a k regular graph on n vertices with nontrivial eigenvalues from the interval r s n k rs k r k s Equality holds if and only if the graph is strongly regular with eigenvalues in fk s rg Nonbipartite distance regular graphs with diameter d and eigenvalues k d whose local graphs satisfy the above bound with equality for s b and r b d are called tight graphs and are...
متن کاملTaut Distance-Regular Graphs of Odd Diameter
Let denote a bipartite distance-regular graph with diameter D ≥ 4, valency k ≥ 3, and distinct eigenvalues θ0 > θ1 > · · · > θD . Let M denote the Bose-Mesner algebra of . For 0 ≤ i ≤ D, let Ei denote the primitive idempotent of M associated with θi . We refer to E0 and ED as the trivial idempotents of M . Let E, F denote primitive idempotents of M . We say the pair E, F is taut whenever (i) E,...
متن کاملA new family of distance-regular graphs with unbounded diameter
We construct distance-regular graphs with the same classical parameters as the Grassmann graphs on the e-dimensional subspaces of a (2e+1)-dimensional space over an arbitrary finite field. This provides the first known family of non-transitive distance-regular graphs with unbounded diameter.
متن کاملValency of Distance-regular Antipodal Graphs with Diameter 4
Let G be a non-bipartite strongly regular graph on n vertices of valency k. We prove that if G has a distance-regular antipodal cover of diameter 4, then k ≤ 2(n + 1)/5 , unless G is the complement of triangular graph T (7), the folded Johnson graph J (8, 4) or the folded halved 8-cube. However, for these three graphs the bound k ≤ (n − 1)/2 holds. This result implies that only one of a complem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2006
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2004.07.004